Memetic Algorithms for Nurse Rostering
نویسنده
چکیده
Nurse rostering problems represent a subclass of scheduling problems that are hard to solve. The goal is finding high quality shift and resource assignments, satisfying the needs and requirements of employees as well as the employers in healthcare institutions. In this paper, a real case of a nurse rostering problem is introduced. Memetic Algorithms utilizing different type of promising genetic operators and a self adaptive violation directed hierarchical hill climbing method are presented based on a previously proposed framework.
منابع مشابه
An Empirical Investigation on Memes, Self-generation and Nurse Rostering
In this paper, an empirical study on self-generating multimeme memetic algorithms is presented. A set of well known benchmark functions is used during the experiments. Moreover, a heuristic template is introduced for solving timetabling problems. The heuristics designed based on this template can utilize a set of constraint-based hill climbers in a cooperative manner. Two such adaptive heuristi...
متن کاملAn advanced model and novel meta-heuristic solution methods to personnel scheduling in healthcare
Constructing timetables of work for personnel in healthcare institutions is known to be a highly constrained and difficult problem to solve. In this thesis, we introduce a model for the practical rostering problem in Belgian hospitals. It is general enough to cope with the large set of constraints and to meet varying objectives encountered in practice. We set up a solution framework that consis...
متن کاملSolving a nurse rostering problem considering nurses preferences by graph theory approach
Nurse Rostering Problem (NRP) or the Nurse Scheduling Problem (NSP) is a complex scheduling problem that affects hospital personnel on a daily basis all over the world and is known to be NP-hard.The problem is to decide which members of a team of nurses should be on duty at any time, during a rostering period of, typically, one month.It is very important to efficiently utilize time and effort, ...
متن کاملAn estimation of distribution algorithm with intelligent local search for rule-based nurse rostering
This paper proposes a new memetic evolutionary algorithm to achieve explicit learning in rule-based nurse rostering, which involves applying a set of heuristic rules for each nurse’s assignment. The main framework of the algorithm is an estimation of distribution algorithm, in which an ant-miner methodology improves the individual solutions produced in each generation. Unlike our previous work ...
متن کاملVariable Neighbourhood Search for Nurse Rostering Problems
Nurse rostering problems consist of assigning varying tasks, represented as shift types, to hospital personnel with different skills and work regulations. We want to satisfy as many constraints and personal preferences as possible while constructing a schedule which meets the personnel requirements of the hospital over a predefined planning period. Real world situations are often so constrained...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005